Randomised block design is more powerful than minimisation
نویسندگان
چکیده
منابع مشابه
Linearity Is Strictly More Powerful Than Contiguity for Encoding Graphs
Linearity and contiguity are two parameters devoted to graph encoding. Linearity is a generalisation of contiguity in the sense that every encoding achieving contiguity k induces an encoding achieving linearity k, both encoding having size Θ(k.n), where n is the number of vertices of G. In this paper, we prove that linearity is a strictly more powerful encoding than contiguity, i.e. there exist...
متن کاملOne-stage design is empirically more powerful than two-stage design for family-based genome-wide association studies
Finding a genetic marker associated with a trait is a classic problem in human genetics. Recently, two-stage approaches have gained popularity in marker-trait association studies, in part because researchers hope to reduce the multiple testing problem by testing fewer markers in the final stage. We compared one two-stage family-based approach to an analogous single-stage method, calculating the...
متن کاملUnchecked Exceptions Can Be Strictly More Powerful Than Call/CC
We demonstrate that in the context of statically-typed purely-functional lambda calculi without recursion, unchecked exceptions (e.g., SML exceptions) can be strictly more powerful than call/cc. More precisely, we prove that a natural extension of the simply-typed lambda calculus with unchecked exceptions is strictly more powerful than all known sound extensions of Girard’s Fω (a superset of th...
متن کاملAdaptation as a more powerful tool than decomposition and integration
Recently a new way of building control systems, known as behavior based robotics, has been proposed to overcome the difficulties of the traditional AI approach to robotics. Most of the work done in behavior-based robotics involves a decomposition process (in which the behavior required is broken down into simpler sub-components) and in an integration approach (in which the modules designed to p...
متن کاملExceptions Are Strictly More Powerful Than Call/CC
We demonstrate that in the context of statically typed pure functional lambda calculi, exceptions are strictly more powerful than call/cc. More precisely, we prove that the simply typed lambda calculus extended with exceptions is strictly more powerful than Girard's F ! [6, 15] (a superset of the simply typed lambda calculus) extended with call/cc and abort. This result is established by showin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMJ
سال: 1999
ISSN: 0959-8138,1468-5833
DOI: 10.1136/bmj.318.7178.263